Koszul factorization and the Cohen–Gabber theorem
نویسندگان
چکیده
منابع مشابه
Gerasimov's Theorem and N -koszul Algebras
This paper is devoted to graded algebras A having a single homogeneous relation. We give a criterion for A to be N-Koszul where N is the degree of the relation. This criterion uses a theorem due to Gerasimov. As a consequence of the criterion, some new examples of N-Koszul algebras are presented. We give an alternative proof of Gerasimov’s theorem for N = 2, which is related to Dubois-Violette’...
متن کاملEquivariant cohomology, Koszul duality, and the localization theorem
(1.1) This paper concerns three aspects of the action of a compact group K on a space X . The ®rst is concrete and the others are rather abstract. (1) Equivariantly formal spaces. These have the property that their cohomology may be computed from the structure of the zero and one dimensional orbits of the action of a maximal torus in K. (2) Koszul duality. This enables one to translate facts ab...
متن کاملOn the Ramseyan Factorization Theorem
We study, in the context of reverse mathematics, the strength of Ramseyan factorization theorem (RFk), a Ramsey-type theorem used in automata theory. We prove that RFk is equivalent to RT 2 2 for all s, k ≥ 2, k ∈ ω over RCA0. We also consider a weak version of Ramseyan factorization theorem and prove that it is in between ADS and CAC.
متن کاملPartial words and the critical factorization theorem
The study of combinatorics on words, or finite sequences of symbols from a finite alphabet, finds applications in several areas of biology, computer science, mathematics, and physics. Molecular biology, in particular, has stimulated considerable interest in the study of combinatorics on partial words that are sequences that may have a number of “do not know” symbols also called “holes”. This pa...
متن کاملUnique factorization theorem
A property of graphs is any class of graphs closed under isomorphism. A property of graphs is induced-hereditary and additive if it is closed under taking induced subgraphs and disjoint unions of graphs, respectively. Let P1,P2, . . . ,Pn be properties of graphs. A graph G is (P1,P2, . . . ,Pn)-partitionable (G has property P1◦P2◦ · · · ◦Pn) if the vertex set V (G) of G can be partitioned into ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 2016
ISSN: 0019-2082
DOI: 10.1215/ijm/1506067294